Test sequence optimisation: an intelligent approach via cuckoo search

نویسندگان

  • Praveen Ranjan Srivastava
  • Chandolu Sravya
  • Ashima
  • Sai Kamisetti
  • Manogna Lakshmi
چکیده

Exhaustive testing is never the appropriate approach in software testing as this violates the principle of cost effectiveness in software development as well as puts time and other resources at stake. This explains the need to optimise the process of software testing. The present paper gives an overview of cuckoo search algorithm and its role in software coverage optimisation. This paper proposes an algorithm to generate optimised test sequence(s), which obtains 100% software coverage based on cuckoo search.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated Test Data Generation Using Cuckoo Search and Tabu Search (CSTS) Algorithm

Software testing is a very important phase in the development of software. Testing includes the generation of test cases which, if done manually, is time consuming. To automate this process and generate optimal test cases, several meta-heuristic techniques have been developed. These approaches include genetic algorithm, cuckoo search, tabu search, intelligent water drop, etc. This paper present...

متن کامل

Application of an Improved Neural Network Using Cuckoo Search Algorithm in Short-Term Electricity Price Forecasting under Competitive Power Markets

Accurate and effective electricity price forecasting is critical to market participants in order to make an appropriate risk management in competitive electricity markets. Market participants rely on price forecasts to decide on their bidding strategies, allocate assets and plan facility investments. However, due to its time variant behavior and non-linear and non-stationary nature, electricity...

متن کامل

A Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)

Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...

متن کامل

Optimal design of axial flux permanent magnet motor using Cuckoo search

In this paper a cuckoo search based optimal design of axial flux permanent magnet motor (AFPMM) is proposed. This approach employs a Cuckoo search (CS) technique as a search tool for optimal design solution of a AFPMM based on the value of the objective function. Several optimisation solutions are analysed and a best solution is proposed based on the values of the optimisation parameters and th...

متن کامل

Cuckoo search via Lévy flights for the capacitated vehicle routing problem

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJBIC

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2012